搜索资源列表
030_Assignment_2_KDTree
- 介绍kd树的基本方法和实现的操作步骤，英文介绍。-The kd tree methods and implementation steps, English.
Algorithm-for-Sequence-Image-Automatic-Mosaic-bas
- Abstract—Constraining by cameras’ view-angles of the outdoor monitoring systems, the panoramic digital images fail to be obtained directly from photographing. A method is proposed on the basis of the scale invariance feature transform (i.
RTGI
- GlobalIllumination(实时全局光照).通过这个源代码,你能够了解到GlobalIllumination和Kd-Tree的实现方式.-GlobalIllumination algorithm.Through this sourcecode,you may have a good knowledge of the algorithm of Real Time GI and kd-tree.
flann-1.7.1-src
- kd-tree的建立与操作,可以应用于三维重建，三维导航-kd-tree establishment and operation can be applied to three-dimensional reconstruction of three-dimensional navigation
kdfilter
- 很好的点云滤波的文章，主要介绍了K-d树的滤波方法-Good point cloud filtering articles, Kd tree filtering method
knn
- 这是一个小而有效的程序来执行的K -近邻搜索算法，此算法利用JIT 理论加速循环，比向量化有效解决了大量数据的精度问题。甚至比kd-tree效果要佳。 K-nearest neighbor search已经广泛应用在科学与工程上，比如模式识别，数据挖掘和信号处理。 -This is a small and effective procedures to implement the K- nearest neighbor search algorithm, this algorithm J
flann-1.8.4-src
- kd-tree的建立与查询,支持多核cpu-Fast Library for Approximate Nearest Neighbors
KDTree-SRC
- KD树，用于范围搜索。大家都懂啦，不用多说了-KD tree for range search
KDTree
- k-d树（k-dimensional树的简称），是一种分割k维数据空间的数据结构。主要应用于多维空间关键数据的搜索（如：范围搜索和最近邻搜索）。用java实现，可直接运行-kd-tree (k-dimensional tree for short), is a partition the data structure of k-dimensional data space. Mainly used in the search of the key data of the multidimensi
sift-kdtree
- 程序实现了对图像sift特征的提取，并利用KD-树对图像进行相似度匹配。-Program image sift feature extraction and similarity matching KD-tree image.
ImageRetrieval
- 本系统利用图片的surf特征进行匹配，KD-tree存储特征数据节点，实现相似图片的检索。实现类似于百度的以图搜图功能，结果返回最相似的前十名的图片。-The system uses a picture of the surf feature match, KD-tree storage feature data node, similar image retrieval. Similar to Baidu to search map function returns the results o
kdTree
- 最近邻算法的构建，构造kd-tree。是统计学习方法中的经典方法。是其源码实现。-Nearest neighbor algorithm, constructed kd-tree. The classical method is a statistical learning method. Its source code to achieve.
knn
- 实现构建k-d树并且实现k-d树上的最邻近查找算法-Build a kd-tree and kd tree nearest neighbor search algorithm
sift-panoramas
- 用SIFT+kd-tree+RANSAC算法。首先，提取SIFT特征点，再次构建kd-tree寻求与关键点最近的和次近的点，用BBF搜索算法遍历，再由RANSAC求变换矩阵 -Algorithms SIFT+kd-tree+RANSAC. First, the extracted SIFT feature points again to build a KD-Tree to seek the key points and sub-points near BBF search algorith
kdtree
- KD-Tree的c++实现，并有文档详细介绍了KD-Tree的实现算法。-KD-Tree of c++ implementation, detailing the implementation of the KD-Tree algorithm.
kdtree
- 用matlab进行图像拼接时，可以用到的程序，或可参考。K-D树。我没看懂-Using matlab for image stitching, you can use a program, or a reference. KD tree. I did not understand
kdtree
- KD树 KDtree的建立到最近领域的搜索，简单易懂-KD tree KDtree establishment to the nearest field of search, easy to understand
KD_Tree
- 基于K维空间索引的点查询算法KD树，本代码实现一般的查询功能-K-dimensional space-based index point KD tree search algorithm, the code search function in general
siftPransac
- SIFT点提取，KD树特征匹配，再用随机抽样一致算法去除无匹配-SIFT extraction, KD tree feature matching, and then remove the non-random sample consensus algorithm matches
K-nearest-neighbor-algorithm
- 从K近邻算法、距离度量谈到KD树、SIFT+BBF算法,讲解详细，非常有用-From K neighbor algorithm and distance measurement when it comes to KD tree, SIFT+ BBF algorithm, explain in detail, very useful